package SortAlgorithm;

import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;

/**
 * @author gao
 * @date 2025/11/5 19:30
 */

public class Test {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        Random random = new Random();
        while (in.hasNext()) {
            int n = in.nextInt();
            int[] nums = new int[n];
            for (int i = 0; i < n; i++) {
                nums[i] = random.nextInt(0, 100);
            }
            System.out.println(Arrays.toString(nums));

            /*InsertSort insertSort = new InsertSort();
            insertSort.sort(nums);*/

            /*ShellSort shellSort = new ShellSort();
            shellSort.sort(nums);*/

            /*QuickSort quickSort = new QuickSort();
            quickSort.sort(nums);*/

            /*MergeSort mergeSort = new MergeSort();
            mergeSort.sort(nums);*/

            BubbleSort bubbleSort = new BubbleSort();
            bubbleSort.sort(nums);

            SelectSort selectSort = new SelectSort();
            selectSort.sort(nums);

            HeapSort heapSort = new HeapSort();
            heapSort.sort(nums);

            System.out.println(Arrays.toString(nums));
        }
    }
}